Quasi-cyclic Random Projection Code and Hardware Implementation
نویسندگان
چکیده
منابع مشابه
Quasi-Cyclic Complementary Dual Code
LCD codes are linear codes that intersect with their dual trivially. Quasi-cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given.
متن کاملOn the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
Random bipartite graphs, random lifts of bipartite protographs, and random cyclic lifts of bipartite protographs are used to represent random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes, respectively. In this paper, we study the distribution of cycles of different length in all these three categories of graphs....
متن کاملTITLE AND SUBTITLE Successive Projection under a Quasi - Cyclic Order
A classical method for finding a point in the intersection of a finite collection of closed convex sets is the successive projection method. It is well-known that this method is convergent if each convex sets is chosen for projection in a cyclical manner. In this note we show that this method is still convergent if the length of the cycle grows without bound, provided that the growth is not too...
متن کاملEfficient Encryption from Random Quasi-Cyclic Codes
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight. We depart somewhat from Aleknovich’s approach and propose an encryption s...
متن کاملRandom Projection-Based Anderson-Darling Test for Random Fields
In this paper, we present the Anderson-Darling (AD) and Kolmogorov-Smirnov (KS) goodness of fit statistics for stationary and non-stationary random fields. Namely, we adopt an easy-to-apply method based on a random projection of a Hilbert-valued random field onto the real line R, and then, applying the well-known AD and KS goodness of fit tests. We conclude this paper by studying the behavior o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications and Network
سال: 2013
ISSN: 1949-2421,1947-3826
DOI: 10.4236/cn.2013.53b2017